Same left co-set and right co-set multipliers for any given finite group
نویسندگان
چکیده
منابع مشابه
Same Left Co - Set and Right Co - Set Multipliers for Any given Finite
This theorem was proved by means of the theory of substitution groups in the QUARTERLY JOURNAL OF MATHEMATICS (vol. 41 (1910), p. 382). A few years later H. W. Chapman gave an abstract proof of the same theorem in the MESSENGER OF MATHEMATICS (vol. 42 (1913), p. 132). In view of the facts that this theorem relates to very fundamental properties of a group and that errors appear in the latter ar...
متن کاملCo-deenite Set Constraints
In this paper, we introduce the class of co-deenite set constraints. This is a natural sub-class of set constraints which, when satissable, have a greatest solution. It is practically motivated by the set-based analysis of logic programs with the greatest-model semantics. We present an algorithm solving co-deenite set constraints and show that their satissa-bility problem is DEXPTIME-complete.
متن کاملCo de nite Set Constraints
In this paper we introduce the class of co de nite set constraints This is a natural sub class of set constraints which when satis able have a greatest solution It is practically motivated by the set based analysis of logic programs with the greatest model semantics We present an algorithm solving co de nite set constraints and show that their satis a bility problem is DEXPTIME complete
متن کاملMatrix Completion From any Given Set of Observations
In the matrix completion problem the aim is to recover an unknown real matrix from a subset of its entries. This problem comes up in many application areas, and has received a great deal of attention in the context of the netflix prize. A central approach to this problem is to output a matrix of lowest possible complexity (e.g. rank or trace norm) that agrees with the partially specified matrix...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1923
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1923-03759-2